Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices
نویسندگان
چکیده
Two algorithmic techniques for specifying the existence of a k×k submatrix with elements 0,±1 in a skew and symmetric conference matrix of order n are described. This specification is achieved using an appropriate computer algebra system.
منابع مشابه
New weighing matrices constructed from two circulant submatrices
A number of new weighing matrices constructed from two circulants and via a direct sum construction are presented, thus resolving several open cases for weighing matrices as these are listed in the second edition of the Handbook of Combinatorial Designs.
متن کاملOn circulant weighing matrices
Algebraic techniques are employed to obtain necessary conditions for the existence of certain circulant weighing matrices. As an application we rule out the existence of many circulant weighing matrices. We study orders n = 8 +8+1, for 10 ~ 8 ~ 25. These orders correspond to the number of points in a projective plane of order 8.
متن کاملEla the Maximum Number of 2 × 2 Odd Submatrices In
Let A be an m×n, (0, 1)-matrix. A submatrix of A is odd if the sum of its entries is an odd integer and even otherwise. The maximum number of 2×2 odd submatrices in a (0, 1)-matrix is related to the existence of Hadamard matrices and bounds on Turán numbers. Pinelis [On the minimal number of even submatrices of 0-1 matrices, Designs, Codes and Cryptography, 9:85–93, 1994] exhibits an asymptotic...
متن کاملEigenvectors of block circulant and alternating circulant matrices
The eigenvectors and eigenvalues of block circulant matrices had been found for real symmetric matrices with symmetric submatrices, and for block circulant matrices with circulant submatrices. The eigenvectors are now found for general block circulant matrices, including the Jordan Canonical Form for defective eigenvectors. That analysis is applied to Stephen J. Watson’s alternating circulant m...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005